class Solution:
    def maxCount(self, m, n, ops):
        if not ops:
            return m*n
        a = min(op[0] for op in ops)
        b = min(op[1] for op in ops)
        return a*b
if __name__ == '__main__':
    m, n = 3, 3
    ops = [[2,2],[3,3]]
    print(Solution().maxCount(m, n, ops))